Metric Temporal Logic Translations over the Naturals
نویسندگان
چکیده
We study translations from Metric Temporal Logic (MTL) over the natural numbers to Linear Temporal Logic (LTL). In particular, we present two approaches for translating from MTL to LTL which preserve the EXPSPACE complexity of the satisfiability problem for MTL. Our translations, thus, allow us to utilise LTL provers to solve MTL satisfiability problems.
منابع مشابه
Theorem Proving for Metric Temporal Logic over the Naturals
We study translations from Metric Temporal Logic (MTL) over the natural numbers to Linear Temporal Logic (LTL). In particular, we present two approaches for translating from MTL to LTL which preserve the ExpSpace complexity of the satisfiability problem for MTL. In each of these approaches we consider the case where the mapping between states and time points is given by (1) a strict monotonic f...
متن کاملOn Metric Temporal Description Logics
We introduce metric temporal description logics (mTDLs) as combinations of the classical description logic ALC with (a) LTL, an extension of the temporal logic LTL with succinctly represented intervals, and (b) metric temporal logic MTL, extending LTL with capabilities to quantitatively reason about time delays. Our main contributions are algorithms and tight complexity bounds for the satisfiab...
متن کاملAn Optimal Decision Procedure for MPNL over the Integers
Interval temporal logics provide a natural framework for qualitative and quantitative temporal reasoning over interval structures, where the truth of formulae is defined over intervals rather than points. In this paper, we study the complexity of the satisfiability problem for Metric Propositional Neighborhood Logic (MPNL). MPNL features two modalities to access intervals “to the left” and “to ...
متن کاملMonadic Logic of Order over Naturals has no Finite Base
A major result concerning Temporal Logics (TL) is Kamp’s theorem [Kam68, GHR94], which states that the temporal logic over the pair of modalities X until Y and Xsince Y is expressively complete for the first order fragment of monadic logic of order over the natural numbers. We show that there is no finite set of modalities B such that the temporal logic over B and monadic logic of order have th...
متن کاملSimple Bounded MTL Model Checking for Discrete Timed Automata (extended abstract)
We present a new translation of Metric Temporal Logic to the Linear Temporal Logic with a new set of the atomic propositions. We investigate a SAT-based bounded model checking method for Metric Temporal Logic that is interpreted over linear discrete infinite time models generated by discrete timed automata. We show how to implement the bounded model checking technique for Linear Temporal Logic ...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
عنوان ژورنال:
دوره شماره
صفحات -
تاریخ انتشار 2016